On the k-additive Core of Capacities
نویسندگان
چکیده
We investigate in this paper the set of kadditive capacities dominating a given capacity, which we call the k-additive core. We study its structure through achievable families, which play the role of maximal chains in the classical case (k = 1), and show that associated capacities are elements (possibly a vertex) of the k-additive core when the capacity is (k+1)-monotone. As a particular case, we study the set of k-additive belief functions dominating a belief function. The problem of finding all vertices of the k-additive core is still an open question.
منابع مشابه
On Vertices of the k-Additive Monotone Core
Given a capacity, the set of dominating k-additive capacities is a convex polytope; thus, it is defined by its vertices. In this paper we deal with the problem of deriving a procedure to obtain such vertices in the line of the results of Shapley and Ichiishi for the additive case. We propose an algorithm to determine the vertices of the k-additive monotone core. Then, we characterize the vertic...
متن کاملAn algorithm for finding the vertices of the k-additive monotone core
Given a capacity, the set of dominating k-additive capacities is a convex polytope called the k-additive monotone core; thus, it is defined by its vertices. In this paper we deal with the problem of deriving a procedure to obtain such vertices in the line of the results of Shapley and Ichiishi for the additive case. We propose an algorithm to determine the vertices of the n-additive monotone co...
متن کاملk-Balanced games and capacities
In this paper we present a generalization of the concept of balanced game for finite games. Balanced games are those having a nonempty core, and this core is usually considered as the solution of the game. Based on the concept of k-additivity, we define the so-called k-balanced games and the corresponding generalization of core, the k-additive core, whose elements are not directly imputations b...
متن کاملAxiomatic structure of k-additive capacities
In this paper we deal with the problem of axiomatizing the preference relations modelled through Choquet integral with respect to a k-additive capacity, i.e. whose Möbius transform vanishes for subsets of more than k elements. Thus, k-additive capacities range from probability measures (k = 1) to general capacities (k = n). The axiomatization is done in several steps, starting from symmetric 2-...
متن کاملGeneralized neo-additive capacities and updating
This paper shows that, for Choquet expected utility preferences, the axioms consquentialism, state independence and conditional certainty equivalent consistency under updating characterise a family of capacities, which we call Generalized Neo-Additive Capacities (GNAC). This family contains as special cases, among others, neo-additive capacities as introduced by Chateauneuf, Eichberger, and Gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007